关键词: Gold码, 迭代捕获, 因子图, 顺次校验, 混合校验

Abstract:

To decrease the acquisition time and complexity of Gold code acquisition, m-sequence iterative acquisition algorithm is applied to Gold code. In considering global position system (GPS) C/A code, a group of sparse check relations are found according to creating polynomials of Gold code. And for the purpose of decreasing the complexity of iterative computation, the ordinal check and mixed check method are proposed. Finally, the influences on iterative acquisition performance made by different check relations and different check method are verified by simulation, it shows that the ordinal check with degressive iterative number is getting optimized and effectively decrease the complexity and acquisition time.

Key words: Gold code, iterative acquision, factor graphs, ordinal check, mixed check